K-wise Set-intersections and K-wise Hamming-distances
نویسنده
چکیده
We prove a version of the Ray-Chaudhuri{Wilson and Frankl-Wilson theorems for kwise intersections and also generalize a classical code-theoretic result of Delsarte for k-wise Hamming distances. A set of code-words a1; a2; : : : ; ak of length n have k-wise Hamming-distance `, if there are exactly ` such coordinates, where not all of their coordinates coincide (alternatively, exactly n ` of their coordinates are the same). We show a Delsarte-like upper bound: codes with few k-wise Hamming-distances must contain few code-words.
منابع مشابه
On k-wise set-intersections and k-wise Hamming-distances
We prove a version of the Ray-Chaudhuri–Wilson and Frankl–Wilson theorems for k-wise intersections and also generalize a classical code-theoretic result of Delsarte for k-wise Hamming distances. A set of code-words a; a; . . . ; ak of length n have k-wise Hamming-distance ‘; if there are exactly ‘ such coordinates, where not all of their coordinates coincide (alternatively, exactly n ‘ of their...
متن کاملExtremal set systems with restricted k-wise intersections
A large variety of problems and results in Extremal Set Theory deal with estimates on the size of a family of sets with some restrictions on the intersections of its members. Notable examples of such results, among others, are the celebrated theorems of Fischer, RayChaudhuri–Wilson and Frankl–Wilson on set systems with restricted pairwise intersections. These also can be considered as estimates...
متن کاملK-wise Independence and -biased K-wise Indepedence
1 Deenitions Consider a distribution D on n bits x = x 1 x n. D is k-wise independent ii for all sets of k indices S = fi 1 x ik = a 1 a k ] = 1 2 k : The idea is that if we restrict our attention to any k positions in x, no matter how many times we sample from D, we cannot distinguish D from the uniform distribution over n bits. We can get a Fourier interpretation of k-wise independence by vie...
متن کاملSet-Systems with Restricted Multiple Intersections
We give a generalization for the Deza-Frankl-Singhi Theorem in case of multiple intersections. More exactly, we prove, that if H is a set-system, which satisfies that for some k, the k-wise intersections occupy only ` residue-classes modulo a p prime, while the sizes of the members of H are not in these residue classes, then the size of H is at most (k − 1) ∑̀
متن کاملExact k-Wise Intersection Theorems
A typical problem in extremal combinatorics is the following. Given a large number n and a set L, find the maximum cardinality of a family of subsets of a ground set of n elements such that the intersection of any two subsets has cardinality in L. We investigate the generalization of this problem, where intersections of more than 2 subsets are considered. In particular, we prove that when k − 1...
متن کامل